Real-Time Path Planning of Driverless Mining Trains with Time-Dependent Physical Constraints
نویسندگان
چکیده
While the increased automation levels of production and operation equipment have led to improved productivity mining activity in open pit mines, capacity mine transport system has become a bottleneck. The optimisation is great practical significance reduce cost improve organizational efficiency mines. In this paper, we first formulate multiobjective problem for railway scheduling by introducing set mathematical constraints. As NP-hard, then devise mixed integer programming-based solution solve develop an online framework accordingly. We finally conduct test cases evaluate performance proposed solution. Experimental results demonstrate that efficient able generate train schedule real-time manner.
منابع مشابه
Real-time Path Computation with Reliability Constraints
In this study, we developed algorithms that compute reliability-guaranteed least-cost path(s) between any node pair in a network. These algorithms help carriers to reduce the risk of breaching the service reliability guarantee, and to reduce unnecessary under utilization of their network resource. Simulation results show that our heuristic algorithms achieved very good performance and reduce co...
متن کاملOptimization with the time-dependent Navier-Stokes equations as constraints
In this paper, optimal distributed control of the time-dependent Navier-Stokes equations is considered. The control problem involves the minimization of a measure of the distance between the velocity field and a given target velocity field. A mixed numerical method involving a quasi-Newton algorithm, a novel calculation of the gradients and an inhomogeneous Navier-Stokes solver, to find the opt...
متن کاملTime-Dependent Real-Space Renormalization Group Method
In this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent Hamiltonians. We drive the time-dependent recursion relations for the renormalized tight-binding Hamiltonian by decimating selective sites of lattice iteratively. The formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملReal-time path planning in heterogeneous environments
Modern virtual environments can contain a variety of characters and traversable regions. Each character may have different preferences for the traversable region types. Pedestrians may prefer to walk on sidewalks, but they may occasionally need to traverse roads and dirt paths. By contrast, wild animals might try to stay in forest areas, but they are able to leave their protective environment w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13063729